How Soft Games Can Be Played
نویسنده
چکیده
This paper shows how games can be played that involve natural language, learning, and evolutionary ctitious play. This is implemented using respectively fuzzy logic, neural networks, and evolutionary programming. Because of this combination, they can be called soft games. The algorithm is described, and placed in the context of related research.
منابع مشابه
Optimal sequence for Parrondo games
An algorithm based on backward induction is devised in order to compute the optimal sequence of games to be played in Parrondo games. The algorithm can be used to find the optimal sequence for any finite number of turns or in the steady state, showing that ABABB... is the sequence with the highest steady state average gain. The algorithm can also be generalized to find the optimal adaptive stra...
متن کاملEffective affective user interface design in games.
It is proposed that games, which are designed to generate positive affect, are most successful when they facilitate flow (Csikszentmihalyi 1992). Flow is a state of concentration, deep enjoyment, and total absorption in an activity. The study of games, and a resulting understanding of flow in games can inform the design of non-leisure software for positive affect. The paper considers the ways i...
متن کاملReplicator dynamics with turnover of players
We study adaptive dynamics in games where players abandon the population at a given rate and are replaced by naive players characterized by a prior distribution over the admitted strategies. We demonstrate how such a process leads macroscopically to a variant of the replicator equation, with an additional term accounting for player turnover. We study how Nash equilibria and the dynamics of the ...
متن کاملParity Games Played on Transition Graphs of One-Counter Processes
We consider parity games played on special pushdown graphs, namely those generated by one-counter processes. For parity games on pushdown graphs, it is known from [23] that deciding the winner is an ExpTime-complete problem. An important corollary of this result is that the μ-calculus model checking problem for pushdown processes is ExpTime-complete. As one-counter processes are special cases o...
متن کاملStrategy Composition in Compositional Games
When studying games played on finite arenas, the arena is given explicitly, hiding the underlying structure of the arena. We study games where the global arena is a product of several smaller, constituent arenas. We investigate how these “global games” can be solved by playing “component games” on the constituent arenas. To this end, we introduce two kinds of products of arenas. Moreover, we de...
متن کامل